Rational Approximation with Locally Geometric Rates
نویسندگان
چکیده
منابع مشابه
Geometric Rates of Approximation by Neural Networks
Model complexity of feedforward neural networks is studied in terms of rates of variable-basis approximation. Sets of functions, for which the errors in approximation by neural networks with n hidden units converge to zero geometrically fast with increasing number n, are described. However, the geometric speed of convergence depends on parameters, which are specific for each function to be appr...
متن کاملPreconditioner Construction with Rational Approximation
AbRtract This paper deals with the domain decomposition-based preconditioned conjugate gradient method. The Schur complement is expressed as a function of & simple interface matrix. This function is approximated by a simple rational function to generate a simple matrix that is then used 8.8 & preconditioner for the Schur complement. Extensive experiments are performed to examine the effectivene...
متن کاملRates of Best Uniform Rational Approximation of Analytic Functions by Ray Sequences of Rational Functions
In this paper, problems related to the approximation of a holomorphic function f on a compact subset E of the complex plane C by rational functions from the class Rn,m of all rational functions of order (n,m) are considered. Let ρn,m = ρn,m( f ; E) be the distance of f in the uniform metric on E from the class Rn,m . We obtain results characterizing the rate of convergence to zero of the sequen...
متن کاملRational Approximation
Recently several authors have investigated the question of approximating certain functions by reciprocals of polynomials under the uniform norm on the positive real axis . Perhaps these results have some applications in industry and elsewhere (cf. [1, 36]) . Our present motivation is to give a detailed list of all the known results with simplified proofs in some cases and many new results and f...
متن کاملLocally Geometric Semantic Crossover
We propose crossover operator for genetic programming that is approximately semantically geometric on the level of homologous program fragments. For a pair of corresponding loci in the parent solutions, the operator finds a semantically intermediate procedure from a library prepared prior to evolutionary run, and inserts it at that location, creating so the offspring. When tested on six symboli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1998
ISSN: 0021-9045
DOI: 10.1006/jath.1997.3121